Network reliability in hamiltonian graphs
نویسندگان
چکیده
The reliability polynomial of a graph gives the probability that remains operational when all its edges could fail independently with certain fixed probability. In general, problem finding uniformly most reliable graphs inside family graphs, is, one whose is at least as large any other family, very difficult. this paper, we study in containing hamiltonian cycle.
منابع مشابه
Hamiltonian Factors in Hamiltonian Graphs
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor. Keywords—graph, neighborhood, factor, Hamiltonian factor.
متن کاملUncoverings on graphs and network reliability
We propose a network protocol similar to the k-tree protocol of Itai and Rodeh [Inform. and Comput. 79 (1988), 43–59]. To do this, we define a t-uncovering-by-bases for a connected graph G to be a collection U of spanning trees for G such that any t-subset of edges of G is disjoint from at least one tree in U , where t is some integer strictly less than the edge connectivity of G. We construct ...
متن کاملOn pancyclism in hamiltonian graphs
We investigate the set of cycle lengths occurring in a hamiltonian graph with at least one or two vertices of large degree. We prove that in every case this set contains all the integers between 3 and some t, where t depends on the order of the graph and the degrees of vertices. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملLong Cycles in Hamiltonian Graphs
We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.
متن کاملSmall Cycles in Hamiltonian Graphs
We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2021
ISSN: ['1873-636X', '1572-5286']
DOI: https://doi.org/10.1016/j.disopt.2021.100645